Deadline First Scheduling in Switched Real-Time Ethernet − Deadline Partitioning Issues and Software Implementation Experiments
نویسندگان
چکیده
This paper presents work on a switched Ethernet network extended to allow for earliest deadline first (EDF) scheduling. We show by example that asymmetric deadline partitioning between the links of a real-time channel can increase the utilization substantially, still not violating the real-time guarantees. We also report measurements on a software implementation of the switch on an ordinary PC.
منابع مشابه
Switched Real-Time Ethernet in Industrial Applications - Asymmetric Deadline Partitioning Scheme
This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The result of the simulations of setting up RT channels over a full-duplex switched Ethernet network i...
متن کاملSwitched Real-Time Ethernet in Industrial Applications - Deadline Partitioning
This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadlinefirst (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing l inh toflrom the switch is proposed (ADPS). The scheme is compared with the simpler approach of dividing the deadlines in two (SDPS). The results o...
متن کاملGuaranteed Real-Time Services in Switched Ethernet Networks with Deadline Scheduling in the End Nodes
This paper proposes a switched Ethernet network that supports real-time communication with guaranteed bit rate and end-to-end delay bound. In our proposal, the source nodes use Earliest Deadline First (EDF) scheduling, while the switch uses First Come First Served (FCFS) to control periodic real-time traffic belonging to logical realtime connections. The schedulability condition is drawn and th...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملEDF Scheduling Algorithm for Periodic Messages On Switched Ethernet
In the recent years, there is a strong interest of using switched Ethernet in factory automation. The switched Ethernet offers many attractive features such as large throughput, traffic isolation and full-duplex links. However, although using full-duplex switched Ethernet can limit the collisions to each port, the real-time features may be affected due to the collisions on an output port.This p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002